Comparing Completeness Properties of Static Analyses and Their Logics
نویسنده
چکیده
interpretation: computing on properties readInt(x) if x>0 : x:= pred(x) x:= succ(x) writeInt(x) Q: Is output pos? A: abstractly interpret domain Int by Sign = {neg, zero, pos, any}: readSign(x) if isPos(x): x:= pred(x) x:= succ(x) writeSign(x) where succ(pos) = pos succ(zero) = pos succ(neg) = any succ(any) = any and pred(neg) = neg pred(zero) = neg pred(pos) = any pred(any) = any To answer the question, calculate the static analysis: {zero 7→ pos, neg 7→ any, pos 7→ any, any 7→ any} The Question is decided only for zero — the static analysis is sound but incomplete.
منابع مشابه
Complete Abstractions Everywhere
While soundness captures an essential requirement of the intrinsic approximation of any static analysis, completeness encodes approximations that are as precise as possible. Although a static analysis of some undecidable program property cannot be complete relatively to its reference semantics, it may well happen that it is complete relatively to an approximated and decidable reference semantic...
متن کاملDistinguished algebraic semantics for t-norm based fuzzy logics: Methods and algebraic equivalencies
This paper is a contribution to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and ∆-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate ...
متن کاملModular construction of complete coalgebraic logics
We present a modular approach to defining logics for a wide variety of state-based systems. The systems are modelled as coalgebras, and we use modal logics to specify their observable properties. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular fashion. Moreover, we show that the logics thus obtained inherit soundness, completeness a...
متن کاملModular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, comple...
متن کاملA New Hierarchy of Infinitary Logics in Abstract Algebraic Logic
In this article we investigate infinitary propositional logics from the perspective of their completeness properties in abstract algebraic logic. It is well-known that every finitary logic is complete with respect to its relatively (finitely) subdirectly irreducible models. We identify two syntactical notions formulated in terms of (completely) intersection-prime theories that follow from finit...
متن کامل